An ant colony optimization algorithm for phylogenetic estimation under the minimum evolution principle
نویسندگان
چکیده
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملAnt-Based Phylogenetic Reconstruction (ABPR): A new distance algorithm for phylogenetic estimation based on ant colony optimization
We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO), named Ant-Based Phylogenetic Reconstruction (ABPR). ABPR joins two taxa iteratively based on evolutionary distance among sequences, while also accounting for the quality of the phylogenetic tree built according to the total length of the tree. Similar to optimization algorithms for phylogenet...
متن کاملAnt Colony Optimization Algorithm
Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.
متن کاملAn Efficient Ant Colony Optimization Clustering Algorithm
This paper presents a new algorithm for clustering which is called an “efficient ant colony optimization clustering algorithm” (EACOC) based on a classic algorithm “LF algorithm”. We have proved the algorithm efficiency when dealt with a big variety of different data as well as providing high quality and converging speed simultaneously. This is considered as the outcome of many changes we have ...
متن کاملAnt Colony Optimization under Uncertainty
The goal of the thesis is to study the behavior of the ant colony optimization metaheuristic under uncertain conditions. We choose the probabilistic traveling salesman problem (PTSP) as a test-bed amongst stochastic optimization problems, in much the same way as the traveling salesman problem (TSP) has been considered a standard amongst deterministic optimization problems. Given a set of cities...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Evolutionary Biology
سال: 2007
ISSN: 1471-2148
DOI: 10.1186/1471-2148-7-228